Methods and systems for scheduling ofdm frames

ABSTRACT

System and methods for scheduling OFDM frames are provided. Each packet is assigned to a frame bucket, this amounting to a temporary decision of when to transmit the packet. Each packet is marked with one or more metrics. The metrics are used to sort packets and make scheduling decisions. Packets are analyzed to determine their suitability for MIMO transmission.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.14/293,693, filed Jun. 2, 2014, entitled “METHODS AND SYSTEMS FORSCHEDULING OFDM FRAMES”, which is a continuation of U.S. applicationSer. No. 11/540,571, filed Oct. 2, 2006, entitled “METHODS AND SYSTEMSFOR SCHEDULING OFDM FRAMES”, which claims the benefit of prior U.S.Provisional Application No. 60/799,314, filed May 10, 2006, entitled“METHODS FOR QOS SCHEDULING OF FRAMES WITH MULTIPLE BURSTS AND MULTIPLEMODULATIONS”, which are incorporated by reference herein in theirentirety for all purposes.

FIELD

The invention relates to methods and systems for scheduling OFDM frames.

BACKGROUND

Many schedulers have been defined that are suitable for schedulingsequential transmission of resources on a single transmission mediumthat has common channel conditions. These schedulers are not, ingeneral, applicable to OFDMA scheduling in which there is a twodimensional resource (time and frequency) for use in transmitting tomultiple users that will experience different channel conditions atdifferent times, and for different frequencies within the availablefrequency resource.

SUMMARY

According to one broad aspect, the invention provides a method ofscheduling OFDM frames, each frame comprising at least one OFDM symbol,each OFDM symbol comprising a plurality of subcarriers, the methodcomprising: for each packet to be scheduled assigning the packet aplurality of scheduling metrics; producing at least one ordering ofpackets using the metrics; using the at least one ordering to select aset of packets to send in a current frame; for each OFDM frame,constructing the OFDM frame from packets assigned to the frame byplacing each packet in a respective rectangular time-frequency burstwithin the OFDM frame, at least some of the OFDM frames includingpackets for multiple users; transmitting the OFDM frames using at leastone transmit antenna.

In some embodiments, the at least one ordering comprises: at least onecompulsory ordering that is always performed; at least one ordering thatis performed only some of the time.

In some embodiments, the method further comprises: performing at leastone partial ordering of the packets that treats groups of packetsequally in the partial ordering.

In some embodiments, the method further comprises: determining groups ofpackets that are more optimal than others for transmission in a singleframe, and taking into account such groups in making schedulingdecisions.

In some embodiments, the method further comprises: temporarily assigningeach packet to a particular frame using a deadline for departure for thepacket.

In some embodiments, the method further comprises: where all packetsassigned to a frame to be transmitted fit in the frame, selecting atleast one packet from a later frame bucket using one or more of theorderings.

In some embodiments, the metrics include at least one metric selectedfrom a group comprising: earliest time of departure, deadline fordeparture, user/operator priority, link condition, power save modeconsiderations, frame fitting information.

In some embodiments, the geometrical restriction comprises a list ofpossible rectangular resource sizes that can be used to transmit thepacket.

In some embodiments, the method further comprises updating thegeographical restriction if there is a change in robustness of datatransmission to be used for the packet.

In some embodiments, the indexes comprise at least one: head of lineordering that defines an ordering of a most recent packet for each CID;frame bucket wide ordering that defines an ordering of all packetstemporarily assigned to a given frame; all packets wide ordering thatdefines an ordering of all packets.

In some embodiments, the method further comprises: for at least somefuture frames, allocating resources for the retransmission of packetsthat may require multiple transmissions.

In some embodiments, the amount of resources allocated for futuretransmissions is a function of a statistical likelihood ofretransmission being required.

In some embodiments, the method further comprises: for a frame to betransmitted, performing multiple passes to find improved frame packingof bursts in the frame; stopping performing the passes at a time thatensures the best frame as of that time can be constructed andtransmitted on time.

In some embodiments, the method further comprises allocating at leastsome bursts for simultaneous transmission using MIMO.

In some embodiments, allocating at least some bursts for simultaneoustransmission using MIMO is performed for UL collaborative MIMO.

In some embodiments, allocating at least some bursts for simultaneoustransmission using MIMO comprises: determining sets of bursts that areappropriate for simultaneous transmission using MIMO.

In some embodiments, determining sets of bursts that are appropriate forsimultaneous transmission using MIMO comprises: determining sets ofwireless stations with sufficient orthogonality of channel conditionsfor MIMO and, for such determined sets of wireless stations, determininga number of symbols that can be saved by using MIMO as opposed to notusing MIMO for sets of bursts.

In some embodiments, the method further comprises: selecting the setsthat maximize the savings for UL collaborative MIMO.

In some embodiments, the method further comprises: altering modulationand error coding to be more robust if there is room in the frame;altering modulation and error coding to be less robust if there is lessroom in the frame.

In some embodiments, the method further comprises: receiving packets fortransmission; performing the scheduling for the packets received fortransmission.

In some embodiments, the method further comprises: receiving requestsfor uplink transmission resources; performing scheduling for therequests for uplink transmission resources.

According to another broad aspect, the invention provides an OFDMtransmitter for transmitting OFDM frames, each frame comprising at leastone OFDM symbol, each OFDM symbol comprising a plurality of subcarriers,the scheduler comprising: at least one transmit antenna; a classifierand marker that assigns each packet to be scheduled a plurality ofmetrics; a multi-parameter frame optimizer adapted to: a) produce atleast one ordering of packets using the metrics; b) use the at least oneordering to select a set of packets to send in a current frame over theat least one transmit antenna, at least some frames containing packetsof multiple users.

In some embodiments, a base station comprises: the OFDM transmitter assummarized above.

In some embodiments, said at least one transmit antenna comprises atleast two transmit antennas.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention will now be described with reference to theattached drawings in which:

FIG. 1 is a block diagram of an OFDM communications system;

FIG. 2 is a flowchart of a method of classifying and marking packets inaccordance with an embodiment of the invention;

FIG. 3 is a schematic diagram of a scheduler provided by an embodimentof the invention;

FIGS. 4A through 4E are data structure diagrams for various datastructures used to perform traffic classification and sorting;

FIG. 5 is a schematic diagram showing reprioritization of indexes as aframe fills up;

FIG. 6 is a flowchart of a method of processing packets prior toscheduling; and

FIG. 7 is a flowchart of a method of scheduling packets processed usingthe method of FIG. 6.

DETAILED DESCRIPTION

FIG. 1 is a simplified block diagram of an example of an OFDMcommunications system. In some embodiments, this might be compliant withone or more iterations of one IEEE 802.16 e, the mobile wirelessbroadband standard established by the IEEE and utilized by the WiMAX™Forum. Shown is a base station 10 having a scheduler 12. The basestation has a set of antennas 14,16. In the illustrated example, twoantennas are shown; more generally, for SISO applications, there is oneantenna, and for MIMO applications, there is more than one antenna. TheBTS 10 is shown connected to a network 18. The network 18 can beconsidered to include any network from which/over which packets 19 aredelivered to/from the BTS 10. Also shown is a plurality of mobilestations MS1 20, MS2 22, MS3 24, MS4 26. Given that these stations aremobile, the set of mobile stations that will be in the coverage area ofBTS 10 will change over time and will vary in number. Alternatively,nomadic or fixed wireless devices may be used. Each mobile station20,22,24,26 communicates with the BTS 10 in respect of at least onelogical connection identified by a CID (connection identifier). In aparticular instance illustrated, MS1 20 is shown having logicalconnections with CID1 36, CID2 38. MS2 22 is shown with logicalconnection having CID3 40. MS3 24 is shown with logical connection 42having CID4. Finally, MS4 26 is shown with logical connection 144 havingCID5. More generally, any appropriate number of logical connections foreach of the mobile stations within the coverage area of the BTS 10 maybe established. Multi-access OFDM systems such as shown in FIG. 1 arealso referred to as OFDMA systems. In such systems, frames aretransmitted that include content for multiple receivers.

The BTS 10 transmits using an OFDM transmission format. With OFDM, thereis a set of OFDM sub-carriers that are closely spaced in frequency. Asingle OFDM symbol includes the contents of all of these OFDMsub-carriers over a symbol transmission duration. The format of an OFDMsignal transmitted by the first antenna 14 is generally indicated by 27.This is shown to consist of a sequence of frames 30,32,34 wherefrequency is shown in the vertical direction and time is shown in thehorizontal direction. Each small circle in frame 30 represents what istransmitted on a single sub-carrier for a single symbol duration. Eachframe includes k OFDM symbols, where k≧2. A similar OFDM format is shownfor the second antenna 16 generally indicated at 28 with the first frameindicated at 31. More generally, a similar format is employed for eachantenna of the BTS 10. The OFDM frames represent the two-dimensionalresource that can be allocated for transmission to mobile stations(downlink transmission). A similar frame format may be used to uplinktransmission. In that case, each mobile station is allocated a burst,and multiple mobile stations transmit their bursts so as to fill up theframe. In some embodiments, detailed below, there is overlap between thebursts transmitted by two or more mobile stations in certaincircumstances, this being referred to as collaborative MIMO. It isassumed that any transmission for a given mobile station is to beallocated a rectangular portion of a frame, hereinafter referred to as aburst. In other words, the contents for a given mobile station will bewithin a frame, and will be contained within an N by M resource where Nis a number of sub-carriers and M is a number of OFDM symbol durations.Example allocations during the first frame 30,31 transmitted by twoantennas 14,16 shows allocations 43,44,45,46 for MS1 20, MS2 22, MS3 24and MS4 26 respectively.

Classification and Marking

FIG. 2 is a flowchart of a method of packet classification and markingthat is executed for each packet 19 that is received by the BTS 10. Anincoming packet is received at step 2-1. The packet is classifiedaccording to connection at step 2-2. This might for example involveexamining a CID (connection identifier) within a packet. The CID can beused as an index to a table that acts as a virtual repository ofinformation pertaining to a connection and all packets associated to it.It can be used as key to the information that the BTS has for allconnections. For instance it might contain QoS (quality of service)parameters such as maximum and minimum committed rates and/or channelquality measurements such as CINR (carrier to interference and noiseratio) the receiver reports about the state of the physical conditionsin the radio path to the mobile station. Each packet is marked with oneor more scheduling metrics in step 2-3. Note that the scheduling metricsthat can be applied for different connections can be different. Variousexamples of scheduling metrics are shown generally indicated at 48 andinclude: earliest time of departure, this indicating the earliest framethat a packet may be sent to meet certain QoS or functional requirement;deadline for departure, this indicating a latest frame by which thepacket needs to be transmitted to meet QoS requirements; user/operatorpriorities, this representing a priority that can be used to rankcertain users above certain other users and/or certain operators abovecertain other operators; link condition—this can be used to store one ormore parameters that represent the link over which that particularpacket will be transmitted, particular examples including RSSI (receivedsignals strength indication), CINR, and C/I (carrier to interferenceratio); power save mode considerations—this can be used to storeparameters that represent whether a particular packet is beingtransmitted to a mobile station that has power save mode; frame fittingmetric—this is a parameter that captures geometrical restrictions theframe may impose on how the packets are packed in. Details of many ofthese metrics are provided below.

Frame fitting is a term to describe how suitable a packet is to be putin a frame when considering its dimensions, assuming each packet is tooccupy a rectangular resource. In some embodiments, a packet is taggedwith a set of possible rectangular resource sites that can be used totransmit the packet, and these tags constitute frame fitting metric.

For example, in a 2-dimensional resource a packet of size 32 can beplaced as 2×16 rectangle or a 4×8 rectangle. A packet that needs 32symbols is tagged at this time with its possible dimensions ((2,16),(4,8)). At some later point the number of symbols may be changed (e.g.when the radio conditions worsen a decision may be made to use moresymbols to send the same amount of data for more robustness or if twopackets are to be combined and sent together in a burst) the set ofpossible dimensions is updated as well. The use of the frame fittingmetric in packing a frame is detailed below.

In some embodiments scheduling using the methods described herein isonly performed in the downlink direction. The actual packets to bescheduled are available in this case. In some embodiments, schedulingusing the methods described herein is performed in the uplink direction,and in further embodiments scheduling using the methods described hereinis performed in both the uplink and downlink directions.

For embodiments in which uplink scheduling is to be performed, thescheduler deals with grant-requests which are sent to the schedulerrequesting space in the UL frame to send a packet in the UL direction.The scheduler can process the grant requests much like they are actualpackets, by using its CID to retrieve the connection parameters andcalculating the appropriate metrics.

In some embodiments, scheduling the transmission of signallinginformation for the uplink and/or downlink is treated in the same way.In case of signalling however a real connection ID may not available orapplicable. In some embodiments, non-data, signalling specific keys areused in the same fashion as the CIDs used for data connections.Furthermore, some traffic metrics that are applicable to data trafficmay not be available for signalling. As such special parameters forsignalling such as earliest frame to send, and last frame to send may besubstituted. Other parameters like position in the frame and priorityrelative to other signalling and data are examples that may be specificto signalling.

Various implementations may perform the scheduling using the methodsdescribed for any combination of one or more of downlink packets, uplinkgrant requests, signalling for UL, signalling for DL. References to“packets” in the following refer generally to whatever set of resourcesare to be scheduled in this manner.

Referring now to FIG. 3, shown is a schematic diagram of an exampleimplementation of the scheduler 12. The scheduler can be implemented inhardware, software in which case it is deliverable as computer readablemedium, or a combination of hardware and software, such a combinationincluding at least one circuit such as a microprocessor, DSP, ASIC, FPGAto name a few examples. Incoming packets 19 are classified and markedwith one or more scheduling metrics by classifier and marker 50. Afterclassification and marking, the packets are assigned to one of aplurality of frame buckets. Each frame bucket represents a future frameto be scheduled and transmitted. Assigning a packet to a frame bucketamounts to a temporary assignment of the packet to be transmitted inthat frame when the time arrives. In the illustrated example there arefive frame buckets 52,54,56,58,60. The number of frame buckets can bearbitrarily selected subject to the limitation that most packets willhave a deadline for departure and as such cannot be scheduled further inthe future than this deadline. Note that assignment to a frame bucketcan be logically performed or physically performed. For example, thepacket can be physically moved into a memory location associated with aframe bucket. In another example, the packet can be stored in anarbitrary location, with pointers to the packets stored in the framebuckets.

In some embodiments, each incoming packet has a packet descriptor, thisbeing a data structure that can travel with the packet or be storedseparately. The packet descriptor contains information identifying thephysical location of the packet and other parameters associated with thepacket such as the scheduling metrics. In a particular example, theframe buckets are implemented by using a linked list of pointers betweenthese packet descriptors. An example of such a packet descriptor isindicated at 180 in FIG. 4A. This particular packet descriptor has afield 82 for the location of the packet and a field 84 to point to thenext packet in the same frame bucket. This is also illustrated in FIG. 3where packet descriptors are shown generally at 62. For frame bucket 56,there is a pointer to a first packet descriptor 64 which in turn pointsto a second packet descriptor 66. In a similar manner, the packetdescriptors for each frame bucket can be identified. The packetdescriptor can also include the various metrics determined during packetclassification and marking.

In some embodiments, the packets that are assigned to a given framebucket are not ordered, but rather are all considered equal.

Having determined a frame bucket for each packet and one or moremetrics, packets are now ordered according to their rank on thesemetrics. Various types of ordering can be performed, and examples ofeach of these will be given below. Some orderings are performed acrossall packets that have been received and are awaiting transmission, alsoreferred to as “all packets wide”. Some orderings take place only forthe oldest packets for each CID (also referred to as “head of line”).Some orderings take place on the basis of all packets temporarilyassigned to a given frame, also referred to as “frame bucket wide”.

Referring now to FIG. 3 again, frame bucket wide parameter indexes thatmight be used to establish frame bucket wide ordering are shown at72,74,76,78,80 for frame buckets 52,54,56,58,60 respectively. Each framebucket wide parameter index has a form shown by way of example in FIG.4B generally indicated at 182. This shows pointers PD₁, PD₂, . . .PD_(K) to all of the packet descriptors for the packets stored in eachframe bucket where PD₁ points to the packet descriptor of the highestrank packet according to a particular criteria, and PD_(K) points to thepacket descriptor of the lowest rank packet according to that criteria.Note that there can be multiple different frame bucket wide parameterindexes. Frame bucket wide indexes are useful to find packets that maybe promoted or demoted to an earlier or later frame respectively. Forexample, a radio condition index (which specifies the present conditionof the link to a mobile station) may be used to promote packets thathave better radio conditions now or demote the packets that have poorradio conditions now, the heuristic being that delaying a packet withpoor conditions may allow it to be sent later when the conditionsimprove. The same heuristic can be applied to the case when promoting apacket with good current radio conditions. Note that if the radioconditions vary randomly then sending according to the radio conditionsat their peaks will increase aggregate throughput of the system. Otherpossible frame bucket wide indexes could include fitting metrics likepossible dimensions that were defined earlier.

FIG. 4B is a very specific structure for implementing the frame bucketwide parameter index. In another example, the traffic descriptor of FIG.4A can be supplemented with another field that allows for an orderingaccording to frame bucket wide parameter index.

With further reference to FIG. 3, an example of a connection set wideparameter index that might be used to establish connection set wideordering is indicating generally at 90. A connection set wide parameterindex allows for an ordering of the oldest packets associated with eachconnection identifier.

An example of such a connection set wide ordering is shown in FIG. 4C.This is the same format as the frame bucket wide parameter index of FIG.4B, with a set of indexes I through N_(N) _(—) _(CID) (where N_(N) _(—)_(CID) this is the number of CIDs being indexed) and pointers PD₁ PD_(N)_(—) _(CID) to respective packet descriptors. There can be multiple suchconnection set wide orderings implemented. In FIG. 3, connection setwide parameter index 90 is shown with pointers 92 pointing to variouspacket descriptors according to their order as determined by aconnection set wide parameter ranking.

Finally, an example of an all packets wide parameter index that might beused to establish an all packets wide ordering is indicated at 94. Withsuch an index, all of the packets that have been received are indexedtogether. An example of the structure this might take is shown in FIG.4D where the ordering of all the packets 1 through N_(TOT) is shown witha pointer to a respective packet descriptor for each index. Once again,multiple such orderings can be implemented.

The above discussed fitting metric, in the form of one or more sets ofdimensions, can be used to generate an index of dimensions, either forall packets, on a frame-wide basis, or head of line basis.

The frame bucket wide parameter indexes, connection set wide parameterindexes, and all packet wide parameter indexes are maintained on anongoing basis. As packets are received, they are added to theappropriate indexes. Similarly, as packets are transmitted, they areremoved from the appropriate indexes. Other mechanisms of generating andmaintaining orderings are contemplated.

Partial Ordering

In some embodiments, in addition to the above indexing, the scheduleralso performs partial ordering of packets, again based on one or more ofthe metrics. By partial ordering, it is meant that groups of packets aretreated as equal as opposed to ranking the packets where indexes areused. An example of this is the ordering that is done when packets areput into respective frame buckets. The deadline time for a given packetspecifies which frame a packet is to go out on (in other words whichbucket). Many packets can be in the same frame and are therefore equalin this partial ordering scheme. Thus, as mentioned above, all packetsassigned to a given frame bucket are considered equal in this partialordering. The processing cost to perform partial ordering compared tomaintaining an ordered queue for all packets is much less. A partialordering can be maintained in a similar manner to the above discussedindexes, the only difference being that the order of the packets is notgiven any significance.

Grouping of Packets

Instead of or in addition to trading off one packet against anotherusing the above indexing approaches, in some embodiments groups ofpackets are traded off against each other. In particular, some groupingsof packets can be determined to be more optimal than others. Forexample, a particular set of packets being packed together in a singleframe may be more efficient in terms of transmit resource utilizationthan another set of packets. The following are three different examplesof such packet groupings that can be generated:

a) Packets that fit perfectly (or more perfectly) in a burst within aframe, are more efficient than such a packet that leave holes. Forexample a packet of 100 bytes when modulated may need 20 symbols(depending upon the modulation chosen). These 20 symbols are allocatedinto a frame. The region that these 20 symbols occupy is called theburst that corresponds to the original packet. The scheduler createsbursts for all packets in the frame and tags them appropriately. Themodem takes the bits in the packets and modulates them to fit them inthe burst inside the frame.

b) Bursts destined for a set of mobile stations that have higherorthogonality in terms of radio conditions are better for simultaneoustransmission on multiple antennas. For example, in a MIMO BTS having twoantennas, if a BLAST transmission format is employed, then the bestperformance is realized if the two antennas are used to transmit tomobile stations that are physically spaced as far apart as possible;

c) Sets of bursts that satisfy certain modulation conditions may allowfor better power spread over the frame; in one embodiment, all packetshaving the same modulation type are grouped together in a common frame;in other embodiments, a range of different modulation types within eachframe can result in better performance. The particular combination ofmodulation type or types that will produce the best performance is animplementation specific detail.

The scheduler's primary function is to find “suitable packets” undervarious conditions. At any time the suitability of the packet dependsupon various factors that are represented by its metrics. For example apacket P that may be more suitable to be sent in the next frame thananother packet Q because it is higher on an increasing index ofdeadlines may not be suitable because of its dimensions (indicated bythe dimension index). In this case the scheduler may decide to searchthe index of dimensions to find packets that fit the available space andthen pick the packet with the earliest deadline among them. Dependingupon the conditions and the configuration provided to the scheduler, thescheduler will use various partial orderings and indexes to pickpackets. For example, given indexes {I_(—)1, I_(—)2, . . . } and PartialOrderings {P_(—)1, P_(—)2, . . . }, the scheduler may start with P_(—)1to pick the first set of packets and then remove packets which are abovea certain value in the index I_(—)1, then pick all packets in P_(—)3 andso on. Which partial ordering or index to pick will depend upon thetrade-off or optimization the scheduler is trying to make at aparticular point.

In some embodiments, there is an ordering of the indexes themselves thatmay change from time to time, that the scheduler uses.

As a concrete example the scheduler can start filling a frame with apartial ordering of frame deadline (i.e. first pick all packets thatneed to go out on this frame). If it is able to fit all the packets thathave to be sent it can use index of best radio conditions to fill moreof the frame, assuming it is trying to maximize the achieved throughput.This approach will make sense when there may be a possibility ofcongestion that might be alleviated by higher throughput. However ifthere is not much traffic the scheduler may choose to use deadlineordering again to make sure that packets experience the least amount ofdelay. If it is unable to fit all packets in a deadline grouping in aparticular frame it can decide to use the index of radio conditions toremove the packets that have poor conditions and send them in a laterframe.

An example of this is depicted graphically in FIG. 5. Here it is assumedthat scheduling is to be performed using four indexes I₁, I₂, I₃, I₄.While the frame is empty or almost empty for example as depicted at 200,the priority of the indexes is I₁, I₂, I₃, I₄ as indicated at 202. Whenthe frame becomes about ½ full for example as depicted at 204, theprioritization changes to I₃, I₄, I₁, I₂ as indicated at 206. Finally,when the frame is almost full as depicted at 208, the prioritizationchanges to I₂, I₁, I₄, I₃ as indicated at 210. Thus, as the schedulerfills up the frames, it changes the priority of the indexes (and/orpartial orderings). For the particular example illustrated, the same setof indexes are used each time the prioritization changes. In otherimplementations, one or more new indexes are added to the prioritizationand/or one or more existing indexes are removed from the prioritization.

Once it is time to transmit a frame, if the current frame cannotaccommodate all of the packets that have been assigned to that framebucket, then some of the packets will be moved to a subsequent frame.The selection of which packet or packets to move into a subsequent framemay be made on the basis of ordering a packet inside the frame asdescribed previously. Conversely, if the frame has room to accommodateadditional packets, then the ordering of packets in the next frame canbe used to pick one or more appropriate packets to move forward into thecurrent frame. More generally, multiple metrics may be defined, some ofwhich may be frame specific, some of which may span several frames, someof which may be based on head of line packets (connection set wide) someof which may span all packets. Any of the metrics can then be used inorder to decide which frames to move into a subsequent frame or into aprevious frame.

Use of Frame Fittability when Packing a Frame

When packing a frame, it can be seen quickly if a packet will fit bycomparing a free space in the frame of two dimensional size (x,y) byfinding at least one possible set of dimensions marking for the packet(a_i, b_i) such that EITHER (a_i≦x AND b_i≦y) OR (a_i≦y AND b_i≦x).

In addition the best fitting of a given packet for a given free spacecan be found by matching a free space in the frame with a packet suchthat has the differences x−a_i and y−b_i (for the case that a_i<x ANDb_i<y) are the smallest. This helps in choosing the packets to fill agiven frame. For instance when a packet is to be selected from a set ofpackets to fill up a hole in the frame that is about to be sent out, thepossible dimensions of the available packets are checked, which may besorted for faster comparison, to find the most suitable one. The sortingor hashing of the metrics helps because the scheduler can focus on onlythe most applicable packets.

Note that it is more efficient to use less complex indexing systemswherever possible. An index is less complex when it is performed over asmaller number of packets. The decreasing order of complexity of theindexing systems discussed thus far is:

1) all packets

2) inter head of line packets; and

3) inter frame packets (frame bucket wide indexes).

The ordering and grouping of packets/bursts in some embodiments arecreated as each packet is received. Alternatively one or more of thesefunctions can be performed during the time of framing. Alternatively oneor more of these can be performed at any time, for example in a mannerthat exploits processor idle time.

Returning again to FIG. 2, the multi-parameter frame optimizer 100 usesthe indexes, groupings and ranking of the indexes themselves indetermining which packets to include in which frames. This may forexample involve the use of various objective functions. Objectivefunctions can be linear or more complicated. The scheduler can have aset of objective functions wherein a different objective function can beapplied for each different operating condition.

In some embodiments, a linear optimization algorithm is used to producea frame. With a linear optimization, the metric assigned to a givencombination of packets for a given frame is determined by adding uplinear combinations of the various parameters such as index, grouping,etc. For example, this could start with sets having the best fits,followed by an optimization on the best link condition and so on.

Linear optimization is where given several metrics X, Y and Z (moregenerally any number of metrics) some function F(X,Y,Z) over the metricsis minimized or maximized. In some implementations, the optimization maybe further subject to one or more condition. An example of a specificcondition is: aX+bY=Z. In some embodiments, the indexes of variousmetrics can be viewed as providing values for the metrics rather thanusing the metrics themselves. For example, an index of deadlines can beused to provide values for the deadline metric (say d_(i)) for thepurpose of linear optimization, while the index of link condition can beused to provide values for link condition metric (say for the purpose oflinear optimization and finally the priority index can be used toprovide the priority metric (say p_(i)) for the purpose of linearoptimization. The scheduler may try to maximize a linear function of allthe metrics, weighted with appropriate co-efficients. The following isan example of such a linear function:

R=a×d _(i) +b×l _(i) +c×p _(i)

The scheduler can then pick packets such that the value of R ismaximized. In some embodiments, constants such as the constants a, b andc in the above equation are determined using boundary conditions thatwill commonly also involve system wide conditions such as system load(SL) and system fairness (SF) as well as the packet metrics. Forexample, the condition could be imposed that R must be greater than one(R>1) when SF>0.3 SL>0.5 and D<0, L>10 and P>1, where D L and P are themaximum numerical values for d_(i), l_(i), p_(i) respectively. Suchlinear optimizations along with the metrics and the set of conditionsare programmed into the scheduler.

As a practical example, the following objective function, where thed_(i) and l_(i) are as defined before and v_(i) is the unfairness indexvalue of a packet and B_(max) is the maximum packet size and V is themaximum unfairness, performs well with respect to maximizing systemthroughput while at the same time providing fairness:

$r_{i} = \left\{ \begin{matrix}{l_{i} + {k_{1}d_{i}}} & {{{when}\mspace{14mu} d_{i}} < {0\mspace{14mu} {where}\mspace{14mu} k_{1}} \geq B_{{ma}\; x}} \\{l_{i} + {k_{2}d_{i}}} & {{{when}\mspace{14mu} d_{i}} \geq {0\mspace{14mu} {where}\mspace{14mu} k_{2}} \geq \frac{B_{{ma}\; x}}{V}}\end{matrix} \right.$

In another embodiment higher order optimizations can be used thatsimultaneously use multiple metrics and associated indexes. A higherorder optimization uses polynomial functions like R=a×d_(i) ² b×l_(i)³+c×p_(i). Also different objective functions (e.g., R1, R2, . . . ) maybe used during different system conditions: e.g. use R1 when SF>0 butuse R2 otherwise.

Depending upon the optimization implemented, some optimizations may beNP HARD (non-polynomial hard) meaning that their running time may not bepredictable and has the potential to grow exponentially. In someembodiments, the multi-parameter frame optimizer will perform amulti-stage computation and store intermediate results. A time-out isdefined that will terminate computation in time for the frame to be sentout on schedule. When the time-out occurs, the best intermediate resultis then selected as the final result even though it is possible that itis not the most optimal result. In this manner, any excess processingpower is used, but in the event the optimal solution is not found, thesystem still goes ahead and transmits something on schedule.

The following is an example of how a multipass frame fitter operates inaccordance with some embodiments of the invention:

repeat until time to send the frame { for p in all packets already inthe frame { place p in a better position /*e.g. a better position wouldbe a space that leaves more contiguous free space*/ }CalculateTotalfreespace( ) If total freespace can accommodate nextpacket { Place next packet and store position of packets in intermediateresults } }

Fairness Based on Modulation, ARQ, HARQ

In some embodiments, scheduling is performed in a manner that attemptsto provide fairness having regards to the modulation type employed, andwhether ARQ and/or HARQ is implemented for a particular CID. A packetwhen scheduled and transmitted is to be considered capacity that hasbeen allocated to a particular CID in fair scheduling. However, somepackets are transmitted in a manner that is riskier than others. Forexample, a packet that is transmitted with a higher modulation rate, oremploying various error coding schemes can be accommodated using asmaller amount of space in the frame. However, in return for this thereis a higher likelihood that the packet will need to be re-transmitted.In order to provide fairness, according to the QoS requirements for eachCID a statistical prediction of the likelihood of re-transmission foreach CID can be determined and used to reserve future frames that thepresent transmissions as well as error recovery transmissions (ifneeded) will go out on. For example, a packet that is transmitted usinga high modulation rate and HARQ may statistically have a 25% chance ofrequiring re-transmission, and as such to meet the QoS requirement forthat flow, space for a retransmission packet is saved with 25%probability. In addition if indeed a retransmission is required theretransmitted packet may be picked ahead of other packets that may betransmitted for the first time. If it is expected that severalretransmissions will be required, the scheduler will calculate thedeparture times of the packet and a probable number of retransmissionsto account for the possibility of the delay faced by retransmittedpackets. For example if a packet that has a deadline of D is beingtransmitted such that it is expected to require 2 retransmissions thenthe scheduler will divide the time D into 3 parts where d₁+d₂+d₃=D suchthat the first transmission is send after time t1, the nextretransmission at and the last one at t2.

MIMO Support

As described at the outset, some embodiments employ multiple transmitantennas at the base station, and for such implementations, various MIMOmodes can be supported. Various indexes and groupings can be employed tohelp in determining which packets should be sent in MIMO mode and whatmode should be employed.

One example of a MIMO mode involves sending/receiving more than one datastream simultaneously on different antennas. MIMO modes can be specifiedon a per burst basis inside a frame. For the duration of the burst twoantennas can transmit/receive different data streams.

In some embodiments, the scheduler uses one or more criteria todetermine if such a MIMO mode is efficient. The following is a specificexample of two such criteria:

1) the channels of the two data streams should be uncorrelated as muchas possible; and

2) the space that the MIMO bursts occupy in the frame should beefficiently utilized.

From the second criteria, it is readily apparent that suitablecandidates for such a MIMO mode include two packets that cansubstantially fit within an entire burst in a frame to be transmitted oneach antenna. This is because transmitting a full burst on one antennawhile transmitting a relatively empty burst on the other antenna isinefficient.

To meet the first criteria, link condition indexes and groupings thatmight for example include power, antenna signatures, beam formingvectors can be used to find channels that are sufficiently orthogonal.Packets going over such channels can then be picked by the scheduler tobe transmitted simultaneously on the various antennas. Because theirchannels are uncorrellated the transmissions are likely to be less proneto errors than without this criteria. Finally both criteria can berepresented in a single equation for the scheduler to use as a uniformmeasure of finding MIMO packets.

As an example, consider a base station system with two receive antennaswhich can receive two independent streams from two mobiles u_(i) andu_(j) with packets p_(i) and p_(j) waiting to be sent. Given the channelconditions of all the mobiles that are waiting to send, the base stationscheduler will compute 4 metrics: MIMO mode modulation coding for thepackets if they were to be sent together and the SISO mode modulationsfor the packets if they were sent by themselves in SISO mode. This canbe numerically represented as number of bits per symbol follows:

m_(ij)=bits/symbol for packet p_(i) when paired with packet p_(j);

m_(ji)=bits/symbol for packet p_(j) when paired with packet p_(i);

s_(i)=bits/symbol for packet p_(i) when transmitted in SISO mode;

s_(j)=bits/symbol for packet p_(j) when transmitted in SISO mode.

In order to determine how suitable p_(i) of u_(i) and p_(j) of u_(j) areto be paired in MIMO mode the scheduler will calculate the difference inthe total number of symbols that the packets will take to be sent asSISO and the number of symbols the packets will require if sent as aMIMO burst.

Symbols saved by MIMO=symbols required for MIMO transmission ofp_(i)+p_(j)−symbols for SISO for p_(i)−symbols for SISO for p_(j), andcan be expressed as follows:

$\frac{b_{i}}{s_{i}} + \frac{b_{j}}{s_{j}} - \left( {\frac{b_{i} - {b_{j}\frac{m_{ij}}{m_{ji}}}}{s_{i}} + \frac{b_{j}}{m_{ji}}} \right)$

where b_(i) and b_(j) are the respective packet sizes for mobile u_(i)and u_(j).

Given a set of packets the scheduler will compute a table of the MIMOsavings for all pairings and can then pick the most efficient pairingsto create an efficient frame.

Sleep Mode

In some embodiments, some or all mobile stations have a sleep modeduring which they cannot receive on all frames. Instead, the mobilestation alternates between being “asleep” mode during which it is notlistening, and being “awake” during which it is listening. For a givenmobile station, it will only support the receipt of packets during timesthat it is awake and listening to the channel.

In some embodiments, the sleep mode can be supported by an additionalindex, referred to herein as the “sleep index” that indicates the framesinto which a packet for a given CID can be put. FIG. 4E shows an exampleof a sleep mode index generally indicated at 188 for a given CID_J.Here, the index includes a set of pointers to the valid frames for agiven CID. Once a given frame has been transmitted, a next valid framecan be added to the list so that there is always a set of valid framesfor that CID. Having created such an index, the next frame (before orafter the current frame that a packet is assigned to) that a packet maybe moved to is determined by this sleep mode index. Anytime a packet ismoved from one frame to another it must be done in a manner that isconsistent with this index. For example, the last frame that aparticular packet can be transmitted on and still satisfy its QoS maynot be valid because it is during a period that mobile station is insleep mode. The scheduler will then need to use the sleep mode index topick an earlier frame that is not in the sleep interval.

Intra-Frame Prioritization

Intra-frame prioritization of packets for mobile stations in powersaving mode is also used in some embodiments to help certain mobilestations conserve power. In some implementations, the system maintainsinformation that allows it to determine which mobile stations wouldbenefit from conserving power. For such mobile stations, bursts can beplaced near the beginning of a given frame. Once a given mobile stationreceives its bursts within that frame, it can then go to sleep for theremainder of that frame and the following sleep interval. In an examplescheduler implementation that takes sleep mode into consideration, thescheduler, after deciding on which packets will go in a frame, willcheck if a packet belongs to group of mobiles that require power saving.If so it will place them near the first time slot of the frame.Otherwise the packet can be placed later in the frame, for example at ornear the last time slot of the frame.

In some embodiments, the sleep mode that is assigned to various mobilestations is done in a manner such that the active time intervals for themobile stations is roughly evenly distributed. It would be inefficientto have all of the mobile stations sleeping at the same time. In anotherembodiment, an admission control of sleep enabled flows is performed onthe basis of the capacity of frames that are indexed by the sleep index.More specifically, if multiple mobile stations are expecting to beserviced during particular frames due to their sleep mode, then thiswill need to be considered during admission control of such mobilestations.

Quality of Service

Instead of specifying the QoS in terms of bits/per second or other unitsthat deal with bits, the basic unit of a frame, namely an OFDM symbol,may be used. This is advantageous because it maps directly to the frame,and it removes the uncertainty of channel condition and modulation. Thescheduler can then schedule by distributing the symbols as committed.

Some applications may not be able to use this metric to specify QoSbecause they are usually interested in receiving a certain bandwidth interms of bits per second. However, operators may prefer this metricbecause it maps to a direct cost to them in terms of transmissioncapacity. The symbols/second metric can be used for operator classes oroperator specified user classes. The operators may set limits for thevarious user service classes based on this metric. For instanceoperators may deem that for a class of users (c1) the symbol per secondshould be no greater than a limit (11) while the users that pay more(c2) have no limit. This would provide another level of control of theradio resources. For example, when mobile in class c1 has poor radioconditions it may receive less service limited by symbols/second to thelimit 11, even though its bits/second may be high, while a mobile inclass c2 will always receive the guaranteed bit/second no matter howpoor its radio conditions are.

In the above examples, various metrics or attributes of incoming packetsand their associated indexes and groupings have been described. Variousmetrics have been described that can be useful under variouscircumstances, while some of them such as deadline may be consideredessential in some implementations in which case they are always neededfor the scheduler to process a packet. Indeed it is possible to classifythe metrics of a packet as compulsory or optional. Some metrics can becalculated once and the metric does not change while the packet iswaiting to be sent. Such metrics can be referred to as static metrics.There may also be other metrics that change, possibly every frame. Suchmetrics can be referred to as dynamic metrics. Indexes and groups arecreated so that the scheduler can easily use the metrics that have beencalculated. For instance the earliest departure time index can beimplemented as an index of upcoming frames containing an entry for eachupcoming frame ordered in increasing order of departure. Each frameentry in turn has a list of packets that become eligible after theprevious frame in the list but before the said frame. Once the earliesttime of departure is calculated for a packet, the frame it becomeseligible for can also be calculated. The entry for that particular frameis updated by adding to the list a descriptor of the packet. In similarfashion other metrics and their corresponding indexes are created andupdated.

The following is a specific implementation of the scheduler in which twoprimary threads are employed. More generally, it is to be understoodthat many different scheduler designs can be produced that make use ofthe methods described herein.

A first thread processes packets/grant requests and a second threadcreates the frames. The packet processing thread, which may beimplemented in a separate processor or micro-engine, works as follows,with reference to FIG. 6:

Step 6-1: Find connection ID to get an index into the table of all theproperties of this connection (like QoS parameters);

Step 6-2: Using the connection parameters calculate STATIC andCOMPULSARY metrics (e.g. earliest time of departure, deadline time). Forthe remaining metrics mark with default values;

Step 6-3: For each metric place add the packet descriptor to thecorresponding indexes or groups (e.g. a frame bucket index based onearliest time of departure);

Step 6-4: Repeat from 1 for the next arriving packet.

The second thread creates frames, by operating as follows with referenceto FIG. 7, until the time for handing over the frame to the lower levelmodules occurs. At such time the best saved frame is handed over.

Step 7-1: Using the already created indexes (e.g. earliest departuretime index) and groups, get a set of packets that may be sent in thecurrent frame;

Step 7-2: Calculate compulsory dynamic indexes for packets in the groupabove (e.g. link condition index, which in this case would be framebucket wide);

Step 7-3: Read existing conditions (like current system load, percent offrame filled etc.) and pick appropriate objective function;

Step 7-4: Calculate the rank of the packets based on the objectivefunction;

Step 7-5: For the next highest ranked packet, convert the packet into aburst and find the most appropriate place for the same;

Step 7-6: If collaborative MIMO is possible, regions of the frame withexisting bursts as well as empty regions are checked to find bestplacement. Using the link condition index, existing bursts that arelikely to have an orthogonal channel to the burst being placed arechecked;

Step 7-7: If no suitable MIMO pair is found or if collaborative MIMO isnot applicable: the burst is placed in a part of the frame that iscurrently unoccupied;

Step 7-8: Repeat until next packet doesn't fit because either there areno more packets or frame is full. Save result;

Step 7-9: If frame is full—for all packets in the frame calculatenon-compulsory metrics as well as intraframe-indexes (like sleep index)that allow better packing of frame, if not available already;

Step 7-10: Perform multipass fitter until there is enough room for a newpacket. If so repeat from step 7-3.

In some embodiments, secondary threads use free time on the processor topre-compute the non-compulsory indexes.

In some embodiments, a multi-stage approach is employed to schedulepackets, with stages being executed in sequence for each frame until anacceptable schedule is reached. Remaining stages need not be executed ifan acceptable schedule is reached. For example, in a particularimplementation the first stage involves mapping packets to frames on thebasis of transmission deadline. Then, a subsequent sorting based on oneor more indexes is performed only if necessary. More specifically, ifthe current frame is ready to be transmitted, and everything that needsto be transmitted fits into that frame in an efficient manner, thenthere is no reason to perform further sorting, and the frame can simplybe transmitted. Only if there is a problem with the set of packetsmapped to the current frame is further sorting performed. The compulsoryindexes represent the first stage. The optional indexes andcorresponding metrics are the second stage and sometimes may not becomputed at all or sometimes will only be partially computed. As such,in some embodiments the optional index metrics are computed only whenrequired.

In some embodiments, the modulation and error coding are selected as afunction of how much room there is in a frame. For example, themodulation and error coding may be adjusted to be more robust if thereis room in the frame, or the modulation and error coding may be adjustedto be less robust if there is less room in the frame.

Numerous modifications and variations of the present invention arepossible in light of the above teachings. It is therefore to beunderstood that within the scope of the appended claims, the inventionmay be practiced otherwise than as specifically described herein.

What is claimed is:
 1. A method for transmitting orthogonal frequencydivision multiplexing (OFDM) frames in a multi-access OFDM communicationsystem, the method comprising: by a base station of the multi-accessOFDM communication system: scheduling a set of packets in accordancewith a plurality of scheduling metrics, generating at least one orderingof packets to transmit in an OFDM frame; and transmitting the OFDM frameusing a plurality of transmit antennas, wherein each OFDM frame isconstructed from packets assigned to the OFDM frame, each packet beingplaced in a respective rectangular time-frequency burst within the OFDMframe, and wherein time-frequency bursts transmitted to a first set ofmobile stations are grouped for simultaneous transmission using at leasttwo of the plurality of transmit antennas, wherein channel conditionsfor the first set of mobile stations have a higher orthogonalitycompared to channel conditions for a second set of mobile stations. 2.The method of claim 1, wherein the plurality of scheduling metricsincludes at least one compulsory scheduling metric that remains staticfor multiple OFDM frames and at least one optional scheduling metricthat dynamically changes for each OFDM frame.
 3. The method of claim 1,wherein the set of packets are scheduled by temporarily assigning eachpacket to a particular OFDM frame using a deadline for departure for thecorresponding packet.
 4. The method of claim 1, wherein the plurality ofscheduling metrics includes at least one scheduling metric selected froma group consisting of: earliest time of departure, deadline fordeparture, user/operator priority, link condition, power save modeconsiderations, and frame fitting information.
 5. The method of claim 4,wherein the frame fitting information is updated when there is a changein robustness of data transmission to be used for transmittingcorresponding packets.
 6. The method of claim 1, wherein the at leastone ordering of packets comprises at least one of: a head of lineordering that defines an ordering of a most recent packet for eachconnection identifier (CID); a frame bucket wide ordering that definesan ordering of all packets temporarily assigned to a given OFDM frame;or an all packets wide ordering that defines an ordering of all packets.7. The method of claim 1, further comprising: allocating resources of atleast one future OFDM frame for retransmission of packets that requiremultiple transmissions.
 8. The method of claim 1, further comprising:performing multiple orderings of the packets to select the set ofpackets to send in the OFDM frame to improve a frame packing oftime-frequency bursts in the OFDM frame.
 9. The method of claim 8,further comprising: stop performing the multiple orderings of thepackets when the corresponding OFDM frame can be constructed based on amost improved frame packing of time-frequency bursts and transmitted ontime.
 10. The method of claim 1, further comprising: allocating at leastsome time-frequency bursts to a third set of mobile stations forsimultaneous transmission in an uplink (UL) direction using ULcollaborative multiple-input multiple-output (MIMO) transmission. 11.The method of claim 10, wherein allocation of the at least sometime-frequency bursts to the third set of mobile stations comprises atleast: determining sets of time-frequency bursts that are appropriatefor simultaneous transmission using MIMO; determining mobile stationsthat have sufficient orthogonality of channel conditions for MIMO toinclude in the third set of mobile stations; and determining a number ofsymbols that can be saved by using MIMO as opposed to not using MIMO forsets of time-frequency bursts allocated to the third set of mobilestations.
 12. The method of claim 1, further comprising: alteringrobustness of modulation and encoding for the OFDM frame based onavailable room in the OFDM frame.
 13. A base station comprising: an OFDMtransmitter for transmitting OFDM frames and comprising at least onetransmit antenna; and a scheduling device comprising: a classifierconfigured to classify packets in accordance with one or more schedulingmetrics; and a scheduler configured to schedule a plurality of OFDMframes by assigning each packet to a corresponding OFDM frame using alogical assignment or a physical assignment, wherein packets areassigned to different OFDM frames based on one or more types of orderingof packets, and wherein each OFDM frame is constructed from packetsassigned to the corresponding OFDM frame, each packet being placed in arespective rectangular time-frequency burst within the correspondingOFDM frame.
 14. The base station of claim 13, wherein the physicalassignment of a particular packet to the corresponding OFDM frameincludes storing the particular packet in a memory location associatedwith the OFDM frame.
 15. The base station of claim 13, wherein thelogical assignment of a particular packet to the corresponding OFDMframe includes storing the particular packet in an arbitrary locationand assigning a pointer to the particular packet stored in the OFDMframe.
 16. A method for scheduling OFDM frames for an OFDM communicationsystem, the method comprising: classifying a set of packets inaccordance with one or more scheduling metrics; generating at least oneordering of packets to send in an OFDM frame using the one or morescheduling metrics; and transmitting the OFDM frame using an OFDMtransmitter comprising a plurality of transmit antennas, wherein eachOFDM frame is constructed from packets assigned to the OFDM frame byplacing each packet in a respective rectangular time-frequency burstwithin the OFDM frame, wherein transmissions are grouped forsimultaneous transmission to a first set of mobile stations that have ahigher orthogonality of channel conditions than a second set of mobilestations.
 17. The method of claim 16, wherein the one or more schedulingmetrics used for classifying the set of packets comprise a connectionidentifier (CID) that includes one or more of: (i) a set of quality ofservice (QoS) parameters including a maximum committed rate and aminimum committed rate or (ii) a set of channel quality measurementsincluding a carrier-to-interference-plus-noise ratio (CINR).
 18. Themethod of claim 17, wherein a receiver of the OFDM communication systemreports a state of physical conditions for radio paths between the OFDMcommunication system and mobile stations.
 19. The method of claim 17,wherein the one or more scheduling metrics comprises one or more of: anearliest time of departure, a deadline for departure, user/operatorpriorities, radio path conditions, or power save modes.
 20. The methodof claim 17, wherein each packet of the set of packets are temporarilyassigned to a particular OFDM frame using a deadline for departure forthe corresponding packet.